Deriving Inverse Operators for Modal Logic
نویسندگان
چکیده
Spatial constraint systems are algebraic structures from concurrent constraint programming to specify spatial and epistemic behavior in multi-agent systems. We shall use spatial constraint systems to give an abstract characterization of the notion of normality in modal logic and to derive right inverse/reverse operators for modal languages. In particular, we shall identify the weakest condition for the existence of right inverses and show that the abstract notion of normality corresponds to the preservation of finite suprema. We shall apply our results to existing modal languages such as the weakest normal modal logic, HennessyMilner logic, and linear-time temporal logic. We shall discuss our results in the context of modal concepts such as bisimilarity and inconsistency invariance.
منابع مشابه
Under consideration for publication in Formal Aspects of Computing Generic Composition
This paper presents a technique called generic composition to provide a uniform basis for modal operators, sequential composition, different kinds of parallel compositions and various healthiness conditions appearing in a variety of semantic theories. The weak inverse of generic composition is defined. A completeness theorem shows that any predicate can be written in terms of generic compositio...
متن کاملDeciding ALBO with Tableau
This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. In particular, we de ne a sound and complete tableau calculus for the description logic ALBO and show that it provides a basis for decision procedures for this logic and numerous other description logics. ALBO is the extension o...
متن کاملUsing Tableau to Decide Expressive Description Logics with Role Negation
This paper presents a tableau approach for deciding description logics outside the scope of OWL DL/1.1 and current state-of-the-art tableau-based description logic systems. In particular, we de ne a sound and complete tableau calculus for the description logic ALBO and show that it provides a basis for decision procedures for this logic and numerous other description logics with full role negat...
متن کاملModal-Like Operators in Boolean Lattices, Galois Connections and Fixed Points
In this work, four modal-like operators on Boolean lattices are introduced and their theory is presented from lattice-theoretical, topological and algebraic point of view. It is also shown how rough set approximation operators, modal operators in temporal logic, and linguistic modifiers determined by L-sets can be interpreted as modal-like operators.
متن کاملIntuitionistic Fuzzy Modal Logic Operations: a New Outlook
New properties of intuitionistic fuzzy modal logic operators are discussed and these operators are interpreted as modifications of triangular norms and conorms, and as particular kinds of aggregation operations.
متن کامل